package kyssion.leetcode.num201_250;

public class code207_课程表 {
    private boolean[] isCan;

    public boolean canFinish(int numCourses, int[][] prerequisites) {
        int[] node = new int[numCourses];
        for (int a = 0; a < prerequisites.length; a++) {
            node[prerequisites[a][0]]++;
        }
        return true;
    }
}
